package kyssion.leetcode.num201_250;

import java.util.Arrays;

public class code215_数组中第K大元素 {
    public static void main(String[] args) {
        System.out.println(new code215_数组中第K大元素().findKthLargest(
                new int[]{
                        3,2,3,1,2,4,5,5,6
                },4
        ));
    }
    public int findKthLargest(int[] nums, int k) {
        Arrays.sort(nums);
        return nums[nums.length-k];
    }
}
